Edge‐colored complete graphs without properly colored even cycles: A full characterization
نویسندگان
چکیده
The structure of edge-colored complete graphs containing no properly colored triangles has been characterized by Gallai back in the 1960s. More recently, Cǎda et al. and Fujita independently determined bipartite C 4 . We characterize even cycles, or equivalently, without a 6 In particular, we first deal with simple case 2-edge-colored graphs, using result Yeo. Next, for k ≥ 3, define four classes k-edge-colored cycles prove that any graph cycle belongs to one these classes.
منابع مشابه
Long properly colored cycles in edge colored complete graphs
Let Kc n denote a complete graph on n vertices whose edges are colored in an arbitrary way. Let ∆mon(Kc n) denote the maximum number of edges of the same color incident with a vertex of Kn. A properly colored cycle (path) in Kc n is a cycle (path) in which adjacent edges have distinct colors. B. Bollobás and P. Erdös (1976) proposed the following conjecture: If ∆mon(Kc n) < b 2 c, then Kc n con...
متن کاملProperly colored Hamilton cycles in edge-colored complete graphs
It is shown that for every > 0 and n > n0( ), any complete graph K on n vertices whose edges are colored so that no vertex is incident with more than (1 − 1 √ 2 − )n edges of the same color, contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and n any such K contains a cycle of length k in which adjacent edges have distinct colors.
متن کاملOn Edge-Colored Graphs Covered by Properly Colored Cycles
We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.
متن کاملNote on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and ~ d(n, c); d(n, c) (~ d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and minimum monochromatic degree (out-degree) at least k has a properly colored cycle. Abouelaoualim et al. (2007) stated a conjecture which implies that d(n, c) = 1. Using a recursive construction of c-edge-colored graphs...
متن کاملColored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e., lacks colorful triangles. We then show that, under the operation m◦n ≡ m+n−2, the omitted lengths of colorful cycles in a colored graph form a monoid isomorp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22684